Proof-Theoretic Semantics for a Natural Language Fragment

نویسندگان

  • Nissim Francez
  • Roy Dyckhoff
چکیده

We propose a Proof-Theoretic Semantics (PTS) for a fragment E 0 (delineated below, and extended in the sequel) of Natural Language (NL). This semantics is intended to be incorporated into type-logical grammars(TLG) [4], constituting an alternative to the traditional model-theoretic semantics (MTS), originating in Montague’s seminal work [3], used in TLG. The essence of our proposal is: 1. For sentences, replace truth conditions (in arbitrary models) by canonical derivability conditions (from suitable assumptions). In particular, this involves a “dedicated” proof-system (in natural deduction form), based on which the derivability conditions obtain. The system should be harmonious, in that its rules satisfy certain balance between introduction and elimination, in order to qualify as meaning conferring. Two notions of harmony are shown to be satisfied by the proposed rules. The approach put forward here is different from a related one by Ranta (e.g., [9]), who relates NL constructs to constructive type-theory in Martin-Löf’s theory. 2. For sub-sentential phrases, down to lexical units (words), replace their denotations (in arbitrary models) as conferring meaning, by their contributions to the meanings (i.e. derivability conditions) of sentences in which they occur. This adheres to Frege’s context principle, the latter made more specific by the incorporation into a TLG. For lack of space, extraction of sub-sentential phrase meanings is not shown here. To the best of our knowledge, there has been no attempt to develop PTS as part of a grammar for NL. The following quotation from [13] (p. 2) emphasizes this lack of applicability to NL, the original reason for considering PTS to start with:

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Adjunction-Theoretic Foundation for Proof Search in Intuitionistic First-Order Categorical Logic Programming

In this thesis we compose a proof-theoretic approach to logic programming with a category-theoretic approach to proof theory. This allows us to present the computation mechanisms of several systems of logic programming as proof search strategies within an intuitionistic first-order sequent calculus with logic variables and to analyze aspects of their behavior algebraically. Beginning from the b...

متن کامل

A Generalized Syllogistic Inference System based on Inclusion and Exclusion Relations

Entailment relations are of central importance in the enterprise of natural language semantics. In modern logic, entailment relations are characterized from two viewpoints: the modeltheoretic and proof-theoretic ones. By contrast, most approaches to formalizing entailment relations in natural languages have been solely based on model-theoretic conceptions. Thus, the notion of validity is only c...

متن کامل

What’s behind meaning?

The paper addresses the main questions to be dealt with by any semantic theory which is committed to provide an explanation of how meaning is possible. On one side the paper argues that the resources provided by the development of mathematical logic, theoretical computer science, cognitive psychology, and general linguistics in the 20th Century, however indispensable to investigate the structur...

متن کامل

Proof-theoretic type interpretation: a glimpse to proof-theoretic semantics

A foundation of model-theoretic semantics (MTS) for natural language (NL), ever since Montague’s seminal work, is the typing of meanings, most often expressed in some variant of the simply-typed λ -calculus. Types are interpreted in what is known as Henkin models, whereby basic types τ are interpreted as denoting arbitrary sets Dτ , except for the type t (of sentential meanings), denoting the t...

متن کامل

Plural Semantics for Natural Language Understanding - A Computational Proof-Theoretic Approach

The semantics of natural language plurals poses a number of intricate problems – both from a formal and a computational perspective. In this thesis I investigate problems of representing, disambiguating and reasoning with plurals from a computational perspective. The work defines a computationally suitable representation for important plural constructions, proposes a tractable resolution algori...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009